Increasing the minimum degree of a graph by contractions
نویسندگان
چکیده
منابع مشابه
Increasing the Minimum Degree of a Graph by Contractions
The Degree Contractibility problem is to test whether a given graph G can be modified to a graph of minimum degree at least d by using at most k contractions. We prove the following three results. First, Degree Contractibility is NP-complete even when d = 14. Second, it is fixed-parameter tractable when parameterized by k and d. Third, it is W[1]-hard when parameterized by k. We also study its ...
متن کاملThe Complexity of Degree Anonymization by Graph Contractions
We study the computational complexity of k-anonymizing a given graph by as few graph contractions as possible. A graph is said to be k-anonymous if for every vertex in it, there are at least k − 1 other vertices with exactly the same degree. The general degree anonymization problem is motivated by applications in privacy-preserving data publishing, and was studied to some extent for various gra...
متن کاملGraph minimum linear arrangement by multilevel weighted edge contractions
The minimum linear arrangement problem is widely used and studied in many practical and theoretical applications. In this paper we present a linear-time algorithm for the problem inspired by the algebraic multigrid approach which is based on weighted edge contraction rather than simple contraction. Our results turned out to be better than every known result in almost all cases, while the short ...
متن کاملGraph Minors and Minimum Degree
Let Dk be the class of graphs for which every minor has minimum degree at most k. Then Dk is closed under taking minors. By the Robertson-Seymour graph minor theorem, Dk is characterised by a finite family of minor-minimal forbidden graphs, which we denote by D̂k. This paper discusses D̂k and related topics. We obtain four main results: 1. We prove that every (k + 1)-regular graph with less than ...
متن کاملMinimum degree condition forcing complete graph immersion
An immersion of a graph H into a graph G is a one-to-one mapping f : V (H) → V (G) and a collection of edge-disjoint paths in G, one for each edge of H , such that the path Puv corresponding to edge uv has endpoints f(u) and f(v). The immersion is strong if the paths Puv are internally disjoint from f(V (H)). It is proved that for every positive integer t, every simple graph of minimum degree a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.02.030